Some flow-equivalent planar and non-planar graphs
نویسندگان
چکیده
منابع مشابه
Some flow-equivalent planar and non-planar graphs
We find three non-planar graphs which are flow-equivalent to planar graphs. It is also shown that some non-planar graphs are not flow-equivalent to any planar graph.
متن کاملFlow equivalent trees in undirected node-edge-capacitated planar graphs
Given an edge-capacitated undirected graph G = (V ,E,C) with edge capacity c :E → R+, n = |V |, an s − t edge cut C of G is a minimal subset of edges whose removal from G will separate s from t in the resulting graph, and the capacity sum of the edges in C is the cut value of C. A minimum s − t edge cut is an s − t edge cut with the minimum cut value among all s − t edge cuts. A theorem given b...
متن کاملNon-planar Extensions of Planar Graphs
A graph G is almost 4-connected if it is simple, 3-connected, has at least ve vertices, and V (G) cannot be partitioned into three sets A;B;C in such a way that jCj = 3, jAj 2, jBj 2, and no edge of G has one end in A and the other end in B. A graph K is a subdivision of a graph G if K is obtained from G by replacing its edges by internally disjoint nonzero length paths with the same ends, call...
متن کاملNon-Separable and Planar Graphs.
Introduction. In this paper the structure of graphs is studied by purely combinatorial methods. The concepts of rank and nullity are fundamental. The first part is devoted to a general study of non-separable graphs. Conditions that a graph be non-separable are given ; the decomposition of a separable graph into its non-separable parts is studied; by means of theorems on circuits of graphs, a me...
متن کاملGrinberg's Criterion Applied to Some Non-Planar Graphs
Robertson ([5]) and independently, Bondy ([1]) proved that the generalized Petersen graph P (n, 2) is non-hamiltonian if n ≡ 5 (mod 6), while Thomason [7] proved that it has precisely 3 hamiltonian cycles if n ≡ 3 (mod 6). The hamiltonian cycles in the remaining generalized Petersen graphs were enumerated by Schwenk [6]. In this note we give a short unified proof of these results using Grinberg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00056-5